A Depth Map Post-Processing Approach Based on Adaptive Random Walk With Restart
نویسندگان
چکیده
منابع مشابه
Efficient Processing Node Proximity via Random Walk with Restart
Graph is a useful tool to model complicated data structures. One important task in graph analysis is assessing node proximity based on graph topology. Recently, RandomWalk with Restart (RWR) tends to pop up as a promising measure of node proximity, due to its proliferative applications in e.g. recommender systems, and image segmentation. However, the best-known algorithm for computing RWR resor...
متن کاملDepth Map Up-Sampling Using Random Walk
For the high quality three-dimensional broadcasting, depth maps are important data. Although commercially available depth cameras capture highaccuracy depth maps in real time, their resolutions are much smaller than those of the corresponding color images due to technical limitations. In this paper, we propose the depth map up-sampling method using a high-resolution color image and a low-resolu...
متن کاملDepth Map Boundary Enhancement Using Random Walk
Depth information is essential for depth image-based rendering (DIBR), which is one of the rendering processes for the virtual view using a color image and its corresponding depth map. Although there are several depth estimation methods, more accurate depth estimation is still required. Since inaccurate depth information along object boundaries causes serious rendering errors, depth boundary in...
متن کاملA Random Walk with Exponential Travel Times
Consider the random walk among N places with N(N - 1)/2 transports. We attach an exponential random variable Xij to each transport between places Pi and Pj and take these random variables mutually independent. If transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...
متن کاملProbabilistic Correspondence Matching using Random Walk with Restart
This paper presents a probabilistic method for correspondence matching with a framework of the random walk with restart (RWR). The matching cost is reformulated as a corresponding probability, which enables the RWR to be utilized for matching the correspondences. There are mainly two advantages in our method. First, the proposed method guarantees the non-trivial steady-state solution of a given...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2016
ISSN: 2169-3536
DOI: 10.1109/access.2016.2603220